C3: A Parallel Model for Coarse-Grained Machines
نویسندگان
چکیده
منابع مشابه
C3: A Parallel Model for Coarse-Grained Machines
In this paper, we propose a model for parallel computation, tile C3-modcl. The C3 _ model evaluates, for a given parallel algorithm and target architecture, the complexity of computation, the pattern of communication, and the potential congestion arising during communication. A metric for estimating the effect of link and processor congestion on the performance of a communication operation is d...
متن کاملC3: an architecture-independent model for coarse-grained parallel machines
We propose an architecture-independent parallel model, the C 3-model. The C 3-model evaluates, for a given parallel algorithm and target architecture, the complexity of computation, the pattern of communication , and the potential congestion arising in communication operations. A metric for estimating the eeect of link and processor congestion on the performance of an arbitrary communication op...
متن کاملInteger sorting algorithms for coarse-grained parallel machines
Integer sorting is a subclass of the sorting problem where the elements have integer values and the largest element is polynomially bounded in the number of elements to be sorted. It is useful for applications in which the size of the maximum value of element to be sorted is bounded. In this paper, we present a new distributed radix-sort algorithm for integer sorting. The structure of our algor...
متن کاملSolving large FPT problems on coarse-grained parallel machines
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with previous methods. In this paper, we show how to enhance this approach through the addition of parallelism, thereby allowing even larger problem instances to be solved in practice. More precisely, we demonstrate the po...
متن کاملPACK/UNPACK on Coarse-Grained Distributed Memory Parallel Machines
PACK/UNPACK are Fortran 90/HPF array construction functions which derive new arrays from existing arrays. We present algorithms for performing these operations on coarse-grained parallel machines. Our algorithms are relatively architecture independent and can be applied to arrays of arbitrary dimensions with arbitrary distributionalong every dimension. Experimental results are presented on the
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1996
ISSN: 0743-7315
DOI: 10.1006/jpdc.1996.0010